package codeForce;

import java.util.Scanner;

public class A_LeastProduct {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();

        for (int i = 0; i < n; i++) {
            int negNum=0;
            boolean Zero=false;
            //输入数据
            int len = sc.nextInt();
            int[] arr = new int[len];
            for (int j = 0; j < len; j++) {
                arr[j] = sc.nextInt();
            }
            //开始判断
            for (int j = 0; j < len; j++) {
                if(arr[j]==0){
                    Zero=true;
                    break;
                }else if(arr[j]<0){
                    negNum++;
                }
            }
            //如果有零
            if(Zero){
                System.out.println(0);
            }else if(negNum%2!=0){
                System.out.println(0);
            }else {
                System.out.println(1);
                System.out.println(1+" "+0);
            }

        }

    }
}
